Conic generator for on-the-fly digital television display

ABSTRACT

Apparatus is disclosed to implement a recursive technique to generate the coordinates of horizontal raster line components which intersect a conic-section shape to be represented. The apparatus cooperates with a refresh buffer which stores the video data in coded form to be read out ordered by raster line location and an intermediate buffer which permits these coded data to be read as many times as is needed during the course of displaying one frame of pictorial information, and then to be dropped, and a partial raster assembly storage which permits data to be written randomly along a given raster line.

FIELD OF THE INVENTION

The invention disclosed herein relates to digital television display systems and more particularly to apparatus for generating conic shapes in a coded, on-the-fly digital television display.

BACKGROUND OF THE INVENTION

The conic generator invention disclosed herein is employed as a subsystem in the video generator circuit for a dynamic digital television display disclosed in U.S. Pat. application 478816, A. A. Schwartz, and W. J. Hogan, filed 6/11/74 and assigned to the instant assignee. This video generator circuit system converts randomly occurring data signals representing graphical patterns into a time sequential video signal for use with a sequentially line scanned display device. The circuit is comprised of a threaded buffer connected to receive the data signals and adapted to sort the data signals into groups ordered by extremal scan line positions for the pattern represented. An intermediate buffer has a first input connected to the output of the threaded refresh buffer for storing the ordered data signals once during each display field before the display of the pattern represented and outputting the ordered data signals in synchronism with the line scans of the display. A graphical pattern generator is connected to the output of the intermediate buffer for decoding the ordered data signals outputted therefrom and generating on a first output line components of the pattern represented which lie along the display line to be scanned. A partial raster assembly storage is connected to the first output line from the graphical pattern generator, to store the components of the pattern represented which lie along the display line to be scanned. The graphical pattern generator modifies the decoded ordered data signals to identify the horizontal coordinate for the intersection of the pattern represented with the next display line to be scanned, and outputs the modified data signal over a second output line to a second input line for storage in the intermediate buffer. The graphical pattern generator omits the output of a modified data signal on the second output line when no components of the pattern will intersect succeeding display lines to be scanned in the field.

Prior art digital conic generators have employed recursive techniques to incrementally generate a conic section to be displayed one element at a time. Although this may be suited to random plotters, this mode of generation is not suitable to raster-type devices since the generation time for the conic section is proportional to the number of elements which fall on a raster line. What the art requires is an improved conic shape generator which generates all of the elements on each raster line at a single time and would, therefore, be amenable to high speed television display.

OBJECTS OF THE INVENTION

It is an object of the invention to generate conic sections for display in an improved manner.

It is another object of the invention to generate conic sections for a raster display device in an improved manner.

It is still a further object of the invention to generate conic sections for display on a raster scan device where the elements to be displayed on each raster line are generated at the same time.

It is still a further object of the invention to generate conic sections for an on-the-fly, coded data digital television display in a faster manner than has been available in the prior art.

It is still a further object of the invention to generate a conic section on a digital television display, more accurately and faster than has been available in the prior art.

SUMMARY OF THE INVENTION

The ellipse to be displayed is characterized by a display axis having an inverse slope ΔX_(p) /ΔY which intersects the vertical extrema of the ellipse and an inverse rate of change of the slope of the ellipse of Δ² X_(q) ² /Δ² Y, where the raster lines have a vertical separation of ΔY. The data signals are input to the conic generator having values for the constants ΔX_(p) and Δ² X² _(q) and values for X² _(q) ΔX² _(q), and X_(p) at the extremum of the ellipse, where X_(q) is the horizontal distance from the display axis to the ellipse. The conic generator comprises a register means connected to the output of an intermediate buffer for receiving the values of ΔX_(p), Δ² X² _(q), X_(p), X_(q) ², and ΔX_(q) ². A square root generating means has an input connected to the register means for calculating the square root of X_(q) ². A first adder means having an addend input connected to the output of the square root generator and an augend input connected to the register means calculates the sum X_(p) + X_(q) and the difference X_(p) - X_(q) as the location along the display line to be scanned of the intersection with the ellipse. A video signal generating means has an input connected to the first adder means and an output connected to the partial raster assembly storage, for generating a video signal at the locations along the display line to be scanned corresponding to the values of X_(p) + X_(q) and X_(p) - X_(q). A second adding means having an augend and an addend input connected to the register means adds ΔX_(p) to X_(p) to get a new value of X_(p), ΔX_(q) ² to get a new value of X_(q) ², and Δ² X_(q) ² to ΔX² _(q) to get a new value of ΔX_(q) ². An intermediate buffer output gate has an input connected to the second adding means and a feedback output connected to the input of the intermediate buffer for rewriting the data word into the intermediate buffer with new values for X_(p) X_(q) ² and ΔX_(q) ². The ellipse is displayed as a sequence of vector segments through the iterative operation of the conic generator.

DESCRIPTION OF THE DRAWINGS

The foregoing and other objects, features, and advantages of the invention will be apparent from the following more particular description of the preferred embodiment of the invention, as illustrated in the accompanying drawings.

FIG. 1 illustrates the video generator circuit within which the conic generator invention finds application.

FIG. 2 depicts the data word format for a conic section, which is input to the conic generator.

FIG. 3 shows in detail the vector generator for the video generator circuit of FIG. 1.

FIG. 4 depicts in detail the conic generator invention which finds application in the video generator circuit of FIG. 1.

FIG. 5 illustrates a timing chart for the operation of the conic generator of FIG. 4.

FIG. 6 illustrates a circle simulated with raster segments generated by the conic generator of FIG. 4.

FIG. 7 is a block diagram of the square root generator used in the conic generator of FIG. 4.

FIG. 8A shows the relationship of the axes for the ellipse to be displayed.

FIG. 8B illustrates the vector segments generated for the ellipse of FIG. 8A.

FIG. 8C illustrates the relationship of the coordinates of an ellipse after rotation through an angle θ.

FIG. 9 depicts a block diagram of an alternate embodiment for the conic generator.

DISCUSSION OF THE PREFERRED EMBODIMENT Video Generator System Context for the Conic Generator Invention

FIG. 1 illustrates the context within which the conic generator invention 410 finds application, namely the video generator circuit disclosed in U.S. Pat. application No. 478,816, for a dynamic digital television display.

Dynamic digital TV display operation can be generally described as follows. Digital TV is a display technology which takes coded data from computer sources and converts it to a TV video signal. This signal drives one or more TV monitors which present the desired computer display picture. The logic which converts the coded computer data to a TV signal is all digital, the same as that used in a computer. Thus, digital TV has succeeded in using the technical advances developed in both the TV and computer industries to provide a unique computer display capability.

A TV display in the context used here is one in which one or more electron beams are repeatedly deflected across the face of the Cathode Ray Tube (CRT) in a series of closely spaced parallel lines (called a raster). This is repeated a fixed number of times each second (refresh rate). Within a particular display system the number of parallel lines and the refresh rate are usually fixed. A typical display has 525 lines and is refreshed 30 times per second. Each frame is divided into two fields. One field consists of the odd number scan lines and the other the even scan lines; this results in an interlaced scan which produces an apparent doubling of the refresh rate.

Digital TV presents a computer display in a TV format by reducing the image to a matrix of points or display elements. In a display with horizontal scan lines, the number of vertical display elements is equal to the number of visible scan lines. The number of elements within each scan line is somewhat arbitrary but is typically 1.33 times the number of scan lines. Even though the image is made up of elements, it appears continuous because of the large number of elements used.

The video generator circuit disclosed in U.S. Pat. application No. 478,816 makes use of the new technique of graphic generation known as "on-the-fly" or "implicit refresh" not found in older DTV systems. The on-the-fly technique permits all displayable data to retain its identity in computer coded form up to the final stages of video generation.

In use, implicit refresh allows for erasing data on the display without erasing overlaying (intersecting) data. It permits selective modification of the data. This method of display generation is particularly attractive when blink (flash) and color are desired. The attribute bits for identification of color and flash are contained in computer coded form. In terms of hardware, implicit refresh can reduce the storage requirements in memory by a factor of 18 to 1 for a color graphic display.

The video generator circuit invention shown in FIG. 1, makes use of the "on-the-fly" refresh technique to dynamically generate a digital television display. The video generator circuit is composed of the refresh buffer 28, the intermediate buffer 38, the vector generator 42, an optional symbol generator 40, and the partial raster assembly store 44. The conic generator 410, to which the instant disclosure is directed, is shown connected to the intermediate buffer 38 and the vector generator 42.

The refresh buffer 28 accepts data signals representing picture elements from a data source such as a computer or programmable controller. The refresh buffer 28 reads the data words out, ordered by Y-address, once per field for the vectors, symbol and conic shapes to be displayed, organized as background and dynamic data. The refresh buffer 28 consists of a control module and a storage module providing a total of 8K halfwords, each with sixteen data and two parity bits. The major function of the refresh buffer 28 is to store the coded data for constructing the visual display. Data, which is received from the digital computer over line 68 in random fashion, is stored in a form ordered by Y-line. This allows the refresh buffer 28 to be read on a line-by-line basis. A detailed block diagram of the refresh buffer is shown in FIG. 3 of U.S. Pat. application Ser. No. 478,816.

The data word input from a data processor to the refresh buffer 28 for conic sections require six 32 bit words each, with four additional redundant words to facilitate threading of the data by Y value. Words 3, 4, 5 and 6 of FIG. 2 are paired, each with an additional word 1 containing the value Y, to facilitate identification of threaded queues in the refresh buffer. Data words are transferred from the digital computer to the refresh buffer 28 on a shared bi-directional halfword bus 68.

The intermediate buffer 38 is a small, high-speed, memory, which receives data in coded form from the refresh buffer 28, and transmits the data, in turn to the conic generator 410, symbol generator 40, or vector generator 42, as required. The intermediate buffer 38 receives, from the refresh buffer 28 six 32-bit words for each conic section starting on a raster line. This data is required by the IB 38, as memory space becomes available, prior to the time the raster line is transmitted to the video mixer 46. A detailed block diagram of the intermediate buffer is shown in FIG. 4 of U.S. Pat. application Ser. No. 478,816.

The six coded data words shown in FIG. 2 are transmitted, at high speed, to the conic generator where, in cooperation with the vector generator 42, they are converted into digital video data. Since a conic section may appear on several raster lines, the conic section generator 410 modifies the coded data words, and then rewrites them into the intermediate buffer 38, for use in generating the digital video data for the next raster line. If the video data conversion has been completed during the generation of the current raster line, that particular set of data words is not rewritten into the intermediate buffer 38.

The intermediate buffer 38 is organized into a preload area and an active area, with a total capacity of 256 32-bit words. Data words are transferred from the refresh buffer 28 to the preload area as room becomes available, and from the preload area to the active area as required for display.

The vector generator 42 accepts two data words from the intermediate buffer 38 and uses them to determine which elements on each display line comprise the vector. All vectors are specified by the host processor as individual vectors starting at the top and running downward on the screen. The vector generator's video dot pattern generating circuitry is used by the conic generator 410, to generate video dot patterns for conic sections to be displayed. A detailed block diagram of the vector generator is shown in FIG. 3.

The conic generator invention 410 is shown in FIG. 4. It has an input line 200 from the intermediate buffer 38, a feed back output line 202 to the intermediate buffer 38, and two output lines 412 and 414 to the vector generator 42. A timing diagram for the conic generator is shown in FIG. 5. The conic generator uses coded data in the format shown in FIG. 2 to calculate the starting X coordinate and the ΔX length for each of two raster line segments which represent the intersection of the conic section with that raster line. A circle simulated by raster segments is shown in FIG. 6. These X and ΔX values are output over lines 412 and 414 respectively to the vector generator 42, for generation of the video dot pattern. The conic generator 410, then modifies the contents of the coded data whose format is shown in FIG. 2, to represent the intersection of the conic section with the next raster line to be displayed and outputs this modified data over feed back line 202 to the intermediate buffer 38.

The partial raster assembly store 44 (PRAS) is a high-speed memory with capacity for two full display raster lines in explicit (noncoded video dot pattern) form. All conic section, vector, and symbol dot pattern data are assembled in one line of the PRAS 44 during the line time preceding its normal display presentation. When the video line is to be displayed, the PRAS line is read out at video rate while the next line is being assembled in the second PRAS line. A detailed block diagram of the PRAS is shown in FIG. 7 of U.S. Pat. application Ser. No. 478,816.

The digital video output signal from the PRAS 44 is routed to a video output driver 46, where it is mixed for sync signals, and converted to a composite video signal for transmission over line 192 to the DTV display. One output driver 46 is required for each primary color.

CONIC GENERATOR

The host processor uses an iterative loop to calculate a straight line (Xp) and a displacement from that straight line (Xq). The conic intersections are then Xp ± Xq, as shown in FIG. 8a. The equations are:

    Xp.sub.n.sub.+1 = Xp.sub.n + ΔXp

    Xq.sup.2.sub.n.sub.+1 = Xq.sup.2.sub.n + ΔXq.sup.2.sub.n

    ΔXq.sup.2.sub.n = ΔXq.sup.2.sub.n.sub.-1 + Δ.sup.2 Xq.sup.2

where ΔXp and Δ² Xq² are constants.

The host processor calculates the initial values of Xp, ΔXp, Xq², ΔX² q, and Δ² Xq² as follows.

The equation of an ellipse is Ax² + Bxy + Cy² - 1 = 0 where ##EQU1## where ##EQU2##

    θ = angle of rotation

Next Y.sub.τ is found which is the y value for the topmost point on the ellipse measured from the center of the ellipse. ##EQU3##

Using Y.sub.τ the initial values can be found ##EQU4##

    ΔXq.sub.i.sup.2 = -([Y.sub.τ] - 1)Δ.sup.2 Xq.sup.2

    ΔY = 2[Y.sub.τ]

these values are then written to the y line address corresponding to [Y.sub.τ] + Y_(c), where [Y.sub.τ] is the integer portion of Y.sub.τ, and X_(c) and Y_(c) are the address of the center of the conic.

Using ([Y.sub.τ] - 1/2) in the calculations causes the iterative formulae to calculate the conic intersections at the mid-point between adjacent TV lines (see FIG. 8b). The display is then generated by drawing a horizontal line segment from the intercept 1/2 line above each TV line to the intercept 1/2 line below that line on the TV line. ΔY is the height in TV lines of the conic.

IMPLEMENTATION

A block diagram of the implementation is shown in FIG. 4 with a timing chart shown in FIG. 5.

The conic data is contained in six words of the Intermediate Buffer shown in FIG. 2. These words contain:

    Xq.sup.2, Δ.sup.2 Xq.sup.2, ΔXq.sup.2,

    Xp, ΔXp, ΔY

when the first two words are read Xq² is loaded into the Xq² register 418 and the 24 most significant bits are transferred into SR1 434, (ΔY is are also loaded into ΔY428). Sr1 is a 2-bit-at-a-time shift register which shifts the data up until either a 1 appears in one of the two most significant bit positions or for a maximum of five shift pulses. The number of shift pulses is stored in the shift control logic 440 and the 11 MSBs of SR1 434 are used as inputs to the square root ROM 436.

For the analysis of this method for obtaining a square root, see below. The implementation provides shifting until either the first 1s of Xq² are in the most significant addresses of the ROM 436 or all of the whole number portion (five 2-bit shifts) of Xq² is at the addresses of the ROM 436. When the outputs of the ROM 436 have stabilized, the number is loaded into SR2 438. SR2 438 is a 1-bit-at-a-time shift register and the contents are shifted down the same number of times they were shifted up in SR1 434. This method is a way to use floating point to obtain the square root. For example shifting SR1 434 up five times by 2 bits each time is equivalent to multiplying by 2⁺ ¹⁰, shifting SR2 438 down five times by 1 bit each time is equivalent to multiplying by 2⁻ ⁵ ; thus after 5 shifts:

    SR1 = Xq.sup.2 × 2.sup.10 ##EQU5## after 5 shifts SR2 = Xq × 2.sup.5 × 2.sup.-.sup.5 =Xq

This value is then loaded into Xq_(n) 454.

At the same time, words 3 and 4 are read from the Intermediate Buffer and ΔXq² and the ΔXp are loaded into these respective registers. Xq², ΔXq² and Δ² Xq², are all accurate to 42 bits as required per the error analysis below. These are added in two steps through a 22 bit adder 452. The 22 least significant bits are added and the carry saved, then the 20 most significant bits are added with the carry added in. In this manner Xq² _(n) ₊₁ is generated by adding Xq² _(n) + ΔXq² _(n) and ΔXq² _(n) ₊₁ is generated by adding ΔXq² _(n) + Δ² X² q. Xq² _(n) ₊₁ is loaded into the Xq² register 418 and, when the output of the ROM 436 is loaded into SR2 438, Xq² is loaded into SR1 434 and the square root process repeated to find Xq_(n) ₊₁.

When words 5 and 6 are read from the Intermediate Buffer ΔXp and the Δ² Xq² are loaded into the appropriate registers. The 11 most significant bits of Xp are transferred to the Xp_(n) register 456 and, after ΔXq² _(n) ₊₁ has been calculated, Xp_(n) ₊₁ is calculated and loaded into Xp 456 and Xp_(n) ₊₁ 460 registers. Next, Xp_(n) ₊₂ is calculated and loaded into Xp 420 ready to be rewritten into the I.B. 38. Then, values of Xq² _(n) ₊₂ and ΔXq² _(n) ₊₂ are calculated and loaded into Xq² 418 and ΔXq² 426, respectively, and these values written back into the Intermediate Buffer 38.

When the value of Xq_(n) ₊₁ has been determined, it is loaded into Xq_(n) ₊₁ register 458 and values of

    X.sub.n = Xp.sub.n + Xq.sub.n

    X'.sub.n = Xp.sub.n - Xq.sub.n

    X.sub.n.sub.+1 = Xp.sub.n.sub.+1 + Xq.sub.n.sub.+1

    X'.sub.n.sub.+1 = Xp.sub.n.sub.+1 - Xq.sub.n.sub.+1

are generated from the 11 bit ALUs. These values are transferred into the registers 480, 482, 474, and 472, respectively. Comparitors 484 and 486 control MUX 488 to output the smaller value of X_(n) and X'_(n) and of X_(n) ₊₁ and X'_(n) ₊₁ as the value x on line 412 and the difference as the value Δx on line 414, to the vector generator 42. An off-screen detect circuit is provided to determine when the line segments are off the screen in which case no write to the vector generator is performed. For conics which begin above the top of the visible raster, values of Xp_(i),Xq.sup. 2_(i) and Δ X² q_(i) are calculated by the host processor using the iterative equation.

The value of ΔY is decremented twice each time it is read and compared to zero. When zero is detected, the conic is completed, thus is not written back into the Intermediate Buffer 38. To ensure closure of the conic, Xq_(n) ₊₁ is forced to zero, so that the two vector elements are drawn to Xp_(n) ₊₁, insuring a solid vector at the bottom of the conic.

Special consideration is also made at the top of the conic where Xp_(n) and Xp_(n) ₊₁ are both loaded with Xp_(i) (Xp initial) and Xq_(n) and Xq_(n) ₊₁ are both loaded with Xq_(i) (Xq initial), thus drawing a solid vector at the top of the conic.

MATHEMATICAL ANALYSIS Derivation

The iterative equations for generating conics were derived as follows: Equation of an ellipse: ##EQU6## where a and b are the semi-axis,

    b.sup.2 x.sup.2 + a.sup.2 y.sup.2 = a.sup.2 b.sup.2        (2)

Rotating axis through angle θ as shown in FIG. 8c. ##EQU7##

    X.sub.1 = R cos α

    Y.sub.1 = R sin α

    X.sub.2 = R cos (α + θ)

    Y.sub.2 = R sin (α + θ)

    X.sub.2 = R (cos α cos θ - sin α sin θ) ##EQU8## and

    X.sub.2 = X.sub.1 cos θ - Y.sub.1 sin θ        (3)

    Y.sub.2 = R (sin α cos θ + cos α sin θ) ##EQU9## and

    Y.sub.2 = Y.sub.1 cos θ + X.sub.1 sin θ        (4)

by substitution into (2)

    b.sup.2 (X.sub.1 cosθ - Y.sub.1 sinθ).sup.2 + a.sup.2 (Y.sub.1 cosθ + X.sub.1 sinθ).sup.2 = a.sup.2 b.sup.2.

or, more generally: ##EQU10## Setting ##EQU11## we get

    AX.sup.2 + BXY + CY.sup.2 - 1 = 0.                         (5)

solving for X: ##EQU12## where Xp = -B/2A Y = K₁ Y which is the equation of a straight line.. and ##EQU13##

    X.sub.q.sup.2 = K.sub.2 Y.sup.2 + K.sub.3                  (7)

Y_(t) = y at the top and bottom of the rotated ellipse occurs when X = Xp (that is when Xq = 0).

    K.sub.2 Y.sup.2.sub.T + K.sub.3 = 0 ##EQU14## and ##EQU15##

To develop a recursive formula for Xp:

    Xp.sub.n = K.sub.1 Y.sub.n

    Xp.sub.n.sub.+1 = K.sub.1 Y.sub.n.sub.+1

However, if these are the values of Xp on two consecutive TV lines,

    Y.sub.n.sub.+1 = Y.sub.n - 1

and

    ΔXp = Xp.sub.n.sub.+1 - Xp.sub.n

    ΔXp = (K.sub.1 Y.sub.n - K.sub.1) - K.sub.1 Y.sub.n  (8)

    ΔXp = -K.sub.1.

and new values of Xp can be calculated by

    Xp.sub.n.sub.+1 = Xp.sub.n + ΔXp.                    (9)

Also,

    X.sup.2 q.sub.n = K.sub.2 Y.sup.2.sub. n + K.sub.3

    x.sup.2 q.sub.n.sub.+1 = K.sub.2 Y.sup.2.sub.n.sub.+1 + K.sub.3

    Δx.sup.2 q = (K.sub.2 Y.sup.2.sub.n.sub.+1 + K.sub.3) - (K.sub.2 Y.sup.2.sub.n + K.sub.3) and, since:

    Y.sub.n.sub.+1 = Y.sub.n - 1

    ΔX.sup.2 q = -2K.sub.2 Y.sub.n + K.sub.2 = K.sub.2 (1 - 2Y.sub.n)

and

    X.sup.2 q.sub.n = X.sup.2 q.sub.n.sub.-1 + ΔX.sup.2 q (10)

now

    ΔX.sup.2 q.sub.n = K.sub.2 (1 - 2Y.sub.n)

    ΔX.sup.2 q.sub.n.sub.+1 = K.sub.2 (1 - 2Y.sub.n.sub.+1)

    Δ.sup.2 X.sup.2 q = 2K.sub.2

and

    ΔX.sup.2 q.sub.n = ΔX.sup.2 q.sub.n.sub.-1 + Δ.sup.2 X.sup.2 q.                                                (11)

The conic generator must be supplied with the initial values for X² q, ΔX² q, Δ² X² q, Xp, and ΔXp. From the above derivations Δ² X² q = 2K₂ and ΔXp = -K₁, also Xp_(i) (Xp initial) is ##EQU16## However, these values are all derived relative to the center of the ellipse; therefore, the actual value of X (X_(ACT)) required is

    X.sub.ACT = Xp.sub.i + X.sub.CENTER

where X_(CENTER) is the X coordinate of the center point of the conic. The values of X² q and ΔX² q can be found by solving the initial equations with Y_(n) = Y_(T).

Thus ##EQU17##

However, the value of Y_(T) which was calculated is the theoretical value at the very top and bottom of the conic. The display generator must operate with the values of these quantities at the points which intersect the TV lines. In fact, for the algorithm to be accurate, these values should represent the intersect points half-way between TV line; thus X² q_(i) and ΔX² q_(i) are calculated at a value of Y called Y_(T) which is equal to the integer portion of Y_(T) minus 1/2.

ROUND-OFF ERROR

To determine the accuracy required in the conic generator to result in a ±1 accuracy in the X position, the following analysis was performed. To be within ±1, the value of Xp + Xq must be within ±1/2 because of the digitization error of ±1/2. Therefore, Xp and Xq must be within ±1/4.

    Xp.sub.n = Xp.sub.n.sub.-1 + ΔXp

which is equivalent to

    Xp.sub.n = Xp.sub.i + (n-1)ΔXp

where Xp_(i) = Xp initial, and n is equal to the number of iterations. The error in ΔXp will cause the maximum error in Xp_(n) when n is maximum,

thus

    Xp.sub.n.sbsb.m.sbsb.a.sbsb.x  ± Err Xp.sub.n.sbsb.m.sbsb.a.sbsb.x = Xp.sub.i ± Err Xp.sub.i + (n.sub.max - 1)ΔXp ± (n.sub.max - 1) Err ΔXp

and

    Err Xp.sub.n.sbsb.m.sbsb.a.sbsb.x  = ± Err Xp.sub.i ± (n.sub.max - 1) Err ΔXp

Since only the conic values which occur between the top and bottom of the visible area of the grid are calculated, n_(max) = 2¹⁰

and

    Err Xp.sub.n.sbsb.m.sbsb.a.sbsb.x  = ± Err Xp.sub.i ± (2.sup.10 - 1) Err ΔXp

setting the error equal to 1/4

    2.sup.-.sup.2 = ± Err Xp.sub.i ± (2.sup.10 - (1) Err ΔXp ##EQU18## or ΔXp must be accurate to ± 2.sup.-.sup.12. This is accomplished by calculating ΔXp to 2.sup.-.sup.12 accuracy and rounding off to 2.sup.-.sup.11 for the values originally loaded into the conic generator.

The value of Xp_(i) need not be to this accuracy. As the following analysis of Xq will show, the maximum error in Xq occurs when n = 1/2 n_(max) ; at this point the Err Xp_(n) due to Err ΔXp is only 1/2 Err Xp_(n).sbsb.m.sbsb.a.sbsb.x or ± 2⁻ ³. To maintain Xp_(n) accurate to ± 1/4 at this point then, Xp_(i) need only be accurate to ± 2⁻ ³ which can be accomplished by calculating Xp_(i) to 2⁻ ³ accuracy and round off to 2⁻ ².

For Xq to be ± 1/4, the value of X² q must be correct to ± 1/2 Xq + 1/16.

Values of X² q_(n) are derived as follows:

    X.sup.2 q.sub.1 = X.sup.2 q.sub.i

    X.sup.2 q.sub.2 = X.sup.2 q.sub.1 + ΔX.sup.2 q.sub.i = X.sup.2 q.sub.i + ΔX.sup.2 q.sub.i

    X.sup.2 q.sub.3 = X.sup.2 q.sub.2 + ΔX.sup.2 q.sub.2

where

    ΔX.sup.2 q.sub.2 = ΔX.sup.2 q.sub.i + Δ.sup.2 X.sup.2 q

So

    X.sup.2 q.sub.3 = X.sup.2 q.sub.i + 2 ΔX.sup.2 q.sub.i + Δ.sup.2 X.sup.2 q

    X.sup.2 q.sub.4 = X.sup.2 q.sub.3 + ΔX.sup.2 q.sub.3

where

    ΔX.sup.2 q.sub.3 = ΔX.sup.2 q.sub.2 + Δ.sup.2 X.sup.2 q = ΔX.sup.2 q.sub.i + 2Δ.sup.2 X.sup.2 q

So

    X.sup.2 q.sub.4 = X.sup.2 q.sub.i + 3ΔX.sup.2 q.sub.i + 3Δ.sup.2 X.sup.2 q

and

    X.sup.2 q.sub.5 = X.sup.2 q.sub.i + 4ΔX.sup.2 q.sub.i + 6Δ.sup.2 X.sup.2 q

In general ##EQU19## The error in X² q_(n) is:

    Err X.sup.2 q.sub.n = ± Err X.sup.2 q.sub.i ± (n-1) Err ΔX.sup.2 q.sub.i ##EQU20##

The error in X² q_(i) can be made small by specifying enough bits of X² q_(i). If this is done, ##EQU21##

Since the errors are due to round-off, they can be additive and the maximum error will occur when n = n_(max), which, since the iterative process is only performed over the height of the visible area of the screen, is equal to 2¹⁰. ##EQU22##

Since the maximum error in X² q_(n) occurs when n is a maximum, this means that the greatest error occurs at the bottom of the conic. Because the value of X² q_(n) is a minimum at this point, it is desirable to have the maximum error occur at the mid-point of the conic, when X² q_(n) is maximum. This can be accomplished by introducing an initial error in ΔX² q_(i) which will offset the error caused by Δ² X² q at the bottom of the ellipse. ##EQU23##

One method of accomplishing this is to calculate Δ² X² q to greater accuracy than is used, thus allowing us to know the value of Err Δ² X² q. This then could be multiplied by (n-2)/2 and subtracted from ΔX² q_(i). Another means of accomplishing this is to calculate the value of ΔX² q_(i) by calculating ##EQU24## and using this as ΔX² q_(i). This ensures that when n = 2Y_(T) (i.e., the bottom of the ellipse) the values of ##EQU25## and (n-1) ΔX² q_(i) will be equal. The maximum error will now occur half-way down the conic as follows: ##EQU26##

Differentiating and setting equal to zero yields ##EQU27##

If Y_(T) is large, then

    n ≃ Y.sub.T

to determine the error at this point, we solve the error equation with n equal to Y_(T) and ##EQU28##

since Y_(T).sbsb.m.sbsb.a.sbsb.x is 2⁹

    Err X.sup.2 q.sub.n ≃ 2.sup.17 Err Δ.sup.2 X.sup.2 q

It should be noted here that Δ² X² q cannot be specified using round-off. If round-off were performed, the value of Δ² X² q could be greater than actual, which would cause X² q_(n) to go negative too soon and, depending on the implementation, truncate the conic too soon or cause a negative value which would require an imaginary square root.

IMPLEMENTATION

In the actual implementation, the values of Δ² X² q and ΔX² q_(i) are specified to 2⁻ ²⁰ places. Δ² X² q is actually calculated to 2⁻ ²⁰. The value of ΔXq_(i) ² is calculated to 2⁻ ²⁰ so that its error will be small. The error then can be found to be ##EQU29## which is ##EQU30## and the error at n = Y_(T) = 2⁹ (max error) is ##EQU31##

The error in Xq resulting from the error in X² q is a function of the value of Xq. Since the maximum value of Err Xq_(n) ² is a constant, the error is Xq_(n) will be maximum when Xq_(n) is minimum at the point where Err X² q_(n) is maximum. The minimum value of the minor axis of a conic is 3 (since a conic with a minor axis of 2 can be generated as a vector), thus the minimum value of Xq_(n) when Y = Y_(T) is 1.5, and X² q_(n) = 2.25. The Err X² q_(n) ≃ 2⁻ ³ and

    2.25 ± 2.sup.-.sup.3 ≃ 1.5 ± 1/16

which means that the error in Xq caused by the accumulated error in X² q is at worst ± 1/16 and in general is much less. The maximum error in the square root circuit (below) occurs when Xq_(n) is large (2⁹) at which point the error in Xq_(n) caused by Err X² q_(n) is very small, allowing the allocated error (± 1/4) in Xq to be assigned to the square root circuit.

SQUARE ROOT GENERATOR 442

The method of obtaining the square root is to use a table lookup ROM 436 in conjunction with a two-bit-at-a-time shift register 434. The 24 most significant bits of Xq² are loaded into the shift register 434 of FIG. 7. If either of the two most significant bits is a one, a right shift is executed; if not, a series of left shifts (two bits at a time) is made until either a one is detected in the 2¹⁸ or 2¹⁹ bit positions or until five shifts have been made. Note that after five shifts the integer portion of Xq² has been shifted into position to address the square root table 436. The square root is taken and loaded into the output shift register 438, which executes the same number of shifts in the opposite direction, one bit at a time.

The output of the square root generator 442 is a 12-bit number with 2⁻ ² added to the actual value of the square root of the input. Thus, if Xq'² (where Xq' is the square root of the round-off value of Xq² which is in positions 2⁹ through 2¹⁹ of the input register 434) is the input to the shift register 434, the output will be Xq' + 2⁻ ² or Xq' + 1/4. The 1/4 is added to allow the square root generator 436 to operate without requiring round-off of Xq². The rationale is as follows:

For conics, the maximum error in Xq'² is 2⁸ + 2⁷ + 2⁶ + 2⁵ + ≃ 2⁹. This represents the greatest percentage error when Xq'² = 2¹⁸ since any number less than 2¹⁸ would have resulted in a shift. Therefore, to make Xq within the required ± 1/4, the output of the square root generator 436 must be ± 1/4 for this worst case condition.

For this case, the actual value of Xq² lies between Xq'² and Xq'² + 2⁹ and the actual √Xq² lies between √Xq'² = Xq' = 2⁹ and √Xq'² = 2⁹. The √Xq'² + 2⁹ is approximately equal to Xq' + 1/2 2⁹ + 2⁻ ¹ since (Xq' + 1/2)² = Xq'² + Xq' + 1/4.

Therefore the actual value of √Xq² is between 2⁹ and 2⁹ + 2⁻ ¹. The output of the square root table 436 from above, is Xq' + 2⁻ ² = 2⁹ + 2⁻ ² thus meeting the required ± 1/4 error allocation.

As the value of Xq² becomes smaller, the percentage error incurred becomes smaller, for example if the value of Xq'² is 2¹⁶, the round-off error is only 2⁷ and

    √Xq'.sup.2 = 2.sup.8

    Xq'.sup.2 + 2.sup.7 = 2.sup.8 + 1/4

In this case the output of the square root generator 422 will be Xq' + 1/8 after shifting which is within 1/8 of the actual value.

The accuracy holds for all values of Xq² except those where Xq'² is less than 2⁻ ¹ which could have no input to the square root table 436. Rather than require another shift pulse to examine these bits, a special circuit is provided which forces the output to be equal to 2⁻ ¹ when Xq'² is 2⁻ ², and forces the output to 2⁻ ² when Xq'² is less than 2 ². This is valid since:

    If Xq'.sup.2 = 2.sup.-.sup.2, then X.sup.2 q.sub.max ≃ 2.sup.-.sup.1 and

    X.sup.2 q.sub.min = 2.sup.-.sup.2

    √2.sup.-.sup.1 = 0.707

    and √2.sup.-.sup.2 = 2.sup.-.sup.1

and since the output is forced to be 2⁻ ¹, the ± 1/4 requirement is maintained.

    If Xq'.sup.2 = 0 then X.sup.2 q.sub.max ≃ 2.sup.-.sup.2 and

    X.sup.2 q.sub.min =  0

    √2.sup.-.sup.2 = 2.sup.-.sup.1

    √0 = 0

and since the output is forced to 2⁻ ², the ± 1/4 requirement is again met.

The above analysis was performed assuming that the square root of Xq² need be accurate to ± 1/4 and ignores the error between the actual and theoretical values of Xq² as analyzed above. This can be justified by an examination of these errors. First, a maximum error in the square root circuit occurs when Xq² is a large value, which is at the center of the conic (n = Y_(T)). This is also where the maximum error in the iterative process occurs. However, this value is very small compared to the values of Xq² (2⁻ ³ as compared to 2⁺ ¹⁸) and can be ignored. Also, at this point the error in Xp is only 1/2 the maximum or ± 1/8 so the combined error in Xp + Xq is less than 1/2. The other maximum error in the square root circuit occurs when Xq² is small, which happens at the top and bottom of ellipses. At the top of the ellipse n is small so the error in Xp and Xq² is also small. By forcing a cancellation of errors, the error in Xq² at the bottom of the ellipse is also small (less than 2⁻ ⁹) and can be ignored.

The only values of Xq² which have 1 in bit positions 2²⁰ and 2²¹ are the fixed or expanding range circles of a cursor generator. The error in this case will be larger since the round-off is a larger number. Using the same analysis as above, the minimum value of Xq'² = 2²⁰ and the error ≃ 2¹¹ and

    Xq' = 2.sup.10

    √Xq'.sup.2 + 2.sup.11 ≃ 2.sup.10 + 1

After shifting the output of the square root generator 442 will be

    Xq' + 1/2 = 2.sup.10 + 1/2

thus making the output of the square root circuit ± 1/2 of the actual value of Xq. Since for circles there is no error in the iterative process in either Xp or Xq², the entire ± 1/2 accuracy can be in the square root generator and the overall error maintained at ± 1. Circles do not have errors since ΔXp is zero (no rotation) and ΔXq² and Δ² Xq² are integers (no rotation and a² = b² = radius²).

It should be noted that conics with axis greater than 2¹¹ could be generated with a maximum error of approximately ± 11/8 at the widest points and an error of less than ± 1 for most points.

The timing chart of FIG. 5 shows the possible timing when generating a conic requiring five shifts on each side of the square root generator 442, and can be considered a worst case in terms of conic generator time. The timing chart shows that 42 clock pulses are required:

    42 × 23.437 = 984 nanoseconds

Thus on channels with horizontal line time of 30.989 μsec the maximum number of conics is ##EQU32##

It should be noted that the apparatus can be readily adapted to generate partial circles or ellipses and open conics such as parabolas and hyperbolas.

ALTERNATE EMBODIMENT FOR THE CONIC GENERATOR

An alternate embodiment of the conic generator invention is shown in FIG. 9.

When the first two words are read X_(q) ² is loaded into the X_(q) ² register 418 and the 24 most significant bits are transferred into SR1 434. SR1 434 is a 2-bit-at-a-time shift register which shifts the data until either a 1 appears in one of the two most significant bit positions or for a maximum of five shift pulses. The number of shift pulses is stored in the shift control logic 440 and the 11 MSB's of SR1 434 are used as inputs to the square root ROM 436.

For the analysis of this method for obtaining a square root see above. The implementation provides shifting until either the first 1s of X_(q) ² are in the most significant addresses of the ROM 436 or all of the whole number portion (five 2-bit shifts) of X_(q) ² is at the addresses of the ROM 436. When the outputs of the ROM 436 have stabilized, the number is loaded into SR2 438. SR2 438 is a 1-bit-at-a-time shift register and the contents are shifted down the same number of times they were shifted up in SR1 434. This method is a way to use floating point to obtain the square root. For example, shifting SR1 434 up five times by 2 bits each is equivalent to multiplying by 2⁺ ¹⁰, shifting Sr2 438 down five times by 1 bit each time is equivalent to multiplying by 2⁻ ⁵ thus after 5 shifts:

    SR1 = X.sub.q.sup.2 × 2.sup.10

    and output of ROM = √X.sub.q.sup.2 × 10.sup.+.sup.10 = X.sub.q × 2.sup.5

    after 5 shifts SR2 = X.sub.q × 2.sup.5 × 2.sup.-.sup.5 = X.sub.q

The remaining data words are read from the Intermediate Buffer and loaded into the register and files as shown in FIG. 9. X_(q) ², ΔX_(q) ² and Δ² X_(q) ², are all accurate to 42 bits as required per the error analysis above. These are added in two steps through a 22 bit adder 452. The 22 least significant bits are added and the carry saved, then the 20 most significant bits are added with the carry added in. In this manner X_(q) ² .sbsb.n .sbsb.1 is generated by adding X² _(qn) + ΔX² _(qn) and ΔX² _(qn) ₊₁ is generated by adding ΔX² _(qn) + Δ² X² _(q). X² _(qn) ₊₁ is loaded into the R4 418 register and the square root process repeated to find X_(qn) ₊₁.

The 11 most significant bits of X_(pn) are transferred to the R3 register 456 and X_(n) and X_(n) ' are calculated and loaded into the C & D files where X_(n) = X_(pn) + X_(qn) and X_(n) ' = X_(pn) - X_(qn). Next, X_(pn) ₊₁ is calculated and loaded into R3 register. When the value of X_(qn) ₊₁ has been determined, X_(n) ₊₁ and X_(n) ₊₁ ' are calculated where X_(n) ₊₁ = X_(pn) ₊₁ + X_(qn) ₊₁ and X'_(n) ₊₁ = X_(pn) ₊₁ - X_(qn) ₊₁. These values are used to calculate the starting X and ΔX of the vector segments making up the conic and are sent to the vector generator to be loaded into the PRAS. An off-screen detect circuit is provided to determine when the line segments are off the screen in which case no write to the vector generator is performed. For conics which begin above the top of the visible raster, values of X_(p1) X² _(q1) and ΔX² _(q1) are calculated by the host processor using the iterative equation.

The value of ΔY is decremented each time an intersect is generated and compared to zero. When zero is detected, the conic is completed thus is not written back into the Intermediate Buffer. To insure closure of the conic, X_(q).sbsb.n .sbsb.1 is set to zero insuring a solid vector at the bottom of the conic. The process is repeated until all conic vector segments for the line group have been generated at which point the data is written back to the Intermediate Buffer.

While the invention has been particularly shown and described with reference to preferred embodiments thereof, it will be understood by those skilled in the art that the foregoing and other changes in form and details may be made therein without departing from the spirit and the scope of the invention. 

We claim:
 1. A video generator circuit for converting ordered data signals representing ellipses received from a data buffer into a time sequential video signal for use with a sequentially line scanned display device which displays a field composed of raster lines, wherein the improvement comprises:an input register connected to the output of said data buffer; decoding means connected to the output of said input register, for decoding said ordered data signals outputted from said data buffer and generating on a first output line components of the ellipse represented which lie along the display line to be scanned; modifying means having an input connected to the output of said input register, for modifying said decoded ordered data signals to identify the horizontal coordinate for the intersection of said ellipse represented with the next display line to be scanned and outputting said modified data signal over an output line to an input line for storage in said data buffer; means connected to the output of said input register for inhibiting said outputting of said modified data signal when no components of said ellipse will intersect succeeding display lines to be scanned in said field.
 2. The video generator circuit of claim 1, which further comprises:said raster lines having a vertical separation of ΔY; said ellipse being characterized by a display axis having an inverse slope ΔX_(p) /ΔY and which intersects the vertical extrema of the ellipse and an inverse rate of change of the slope of the ellipse Δ² X_(q) ² /Δ² _(y) ; said data signals including values for the constants ΔX_(p) and Δ² X_(q) ² and values for X_(q) ², ΔX_(q) ² and Xp at the extremum of said ellipse, where X_(q) is the horizontal distance from said display axis to said ellipse.
 3. The video generator circuit of claim 2, wherein:said input register comprises a first register means connected to the output of said data buffer for receiving values of ΔX_(p), Δ² X² _(q), X_(pn), X_(qn) ², and ΔX² _(qn) corresponding to an Nth one of said display lines; and said decoding means comprises: a square root generating means having an input connected to the output of said first register means for calculating the square root of X_(qn) ² ; a first adder means having an addend input connected to the output of said square root generator and an augend input connected to said first register means for calculating the sum X_(pn) + X_(qn) = X_(n) and the difference X_(pn) = X_(qn) = X'_(n) as the location along said Nth display line of the intersection with said ellipse; a second and a third register means connected to the output of said first adder means for storing the values of X_(n) and X'_(n) respectively; a second adder means having an addend input connected to the output of said square root generator and an augend input connected to said first register means for calculating the sum X_(pn) ₊₁ + X_(qn) ₊₁ = X'_(n) ₊₁, and the difference X_(pn) ₊₁ - X_(qn) ₊₁ = X'_(n) ₊₁ as the location along said N+1st display line of the intersection with said ellipse; a forth and a fifth register means connected to the output of said second adder means for storing the values of X_(n) ₋₁ and X'_(n) ₊₁ respectively.
 4. The video generator circuit of claim 3 wherein said square root generating means further comprises:a first shift register having a data input connected to said first register means; a read only memory having its memory address input connected to the high order n bits of said first shift register, for storing the square root of the number stored in said first shift register, rounded to the n most significant bits; a second shift register having a data input connected to the data output of said read only memory and an output connected to said first adder means, for receiving the value of the square root of the number stored in said first shift register rounded to the said n most significant bits; a control means connected to a control input of said first shift register and a control input of said second shift register; said control means shifting the contents of said first shift register two bits at a time for m times until a one bit occupies one of the two most significant bit positions of said first shift register, prior to accessing said read only memory with said shifted data therein; said control means shifting the contents of said second shift register one bit at a time for m times so that the accessed data occupies the least significant bit positions thereof; whereby the square root of X_(q) ² can be accessed in a minimum time with a minimum rounding error.
 5. The video generator circuit of claim 3, wherein said modifying means further comprises:a third adder means having an augend and addend inputs connected to the output of said first register means and an output as a feedback to the input of said first register means to calculate the values of X_(q) ² _(n) ₊₁ = X_(q) ² _(n) + ΔX² _(qn), ΔX² _(qn) ₊₁ = ΔX² _(qn) + Δ² X² _(q) and X_(pn) ₊₁ = X_(pn) + ΔX_(p) corresponding to the intersection of said ellipse with a line intermediate between the Nth and the N+1st ones of said display lines; said third adder means outputting the values of X² _(qn) ₊₁ and X_(pn) ₊₁ to the input of said first register means.
 6. The video generator circuit of claim 5, wherein said decoding means further comprises:said square root generating means calculating the value of X_(qn) ₊₁ input from said first register means; a comparison means connected to said 2nd, 3rd, 4th and 5th register means to determine the larger value of X_(n) or X_(n) ₊₁ and determine the larger value of X'_(n) or X'_(n) ₊₁ ; a fourth adder means connected to said 2nd, 3rd, 4th and 5th register means and to said comparison means to calculate the origin the length of raster strokes along said Nth display line representing intersections with said ellipse; a video signal generating means having an input connected to said fourth adder means and an output connected to said display device for generating a video signal at the locations along said Nth display line corresponding to the intersection with said ellipse.
 7. The video generator circuit of claim 2, wherein:said input register comprises a register means connected to the output of said data buffer for receiving values of ΔX_(p), Δ² X_(q) ², Xp, Xq² and ΔX_(q) ² ; and said decoding means comprises square root generating means having an input connected to said register means for calculating the square root of X_(q) ² ; a first adder means having an addend input connected to the output of said square root generator and an augend input connected to said register means for calculating the sum X_(p) + X_(q) and the difference X_(p) - X_(q) as the location along said display line to be scanned of the intersection with said ellipse; a video signal generating means having an input connected to said first adder means and an output connected to a partial raster assembly storage, for generating a video signal at the locations along said display line to be scanned corresponding to said values of X_(p) + X_(q) and X_(p) - X_(q).
 8. The video generator circuit of claim 7 wherin said square root generating means further comprises:a first shift register having a data input connected to said register means; a read only memory having its memory address input connected to the high order n bits of said first shift register, for storing the square root of the number stored in said first shift register, rounded to the n most significant bits; a second shift register having a data input connected to the data output of said read only memory and an output connected to said first adder means for receiving the value of the square root of the number stored in said first shift register rounded to the said n most significant bits; a control means connected to a control input of said first shift register and a control input of said second shift register; said control means shifting the contents of said first shift register two bits at a time for m times until a one bit occupies one of the two most significant bit positions of said first shift register, prior to accessing said read only memory with said shifted data therein; said control means shifting the contents of said second shift register one bit at a time for m times so that the assessed data occupies the least significant bit positions thereof; whereby the square root of X_(q) ² can be accessed in a minimum time with a minimum rounding error.
 9. The video generator circuit of claim 7, wherein said modifying means further comprises:a second adding means having augend and addend inputs connected to the output of said register means for adding ΔX_(p) to X_(p) to get a new value of X_(p), ΔX_(q) ² to X_(q) ² to get a new value of X_(q) ², and Δ² X_(q) ² to ΔX² _(q) to get a new value of ΔX_(q) ² and a sum output connected to the input of said register means; a data buffer output gate having an input connected to the output of said register means and an output of said modifying means output line connected to the input of said data buffer for rewriting said data word into said data buffer with said new values of X_(p), X_(q) ² and ΔX_(q) ².
 10. The video generator circuit of claim 2, wherein:said input register comprises a first register means connected to the output of said data buffer for receiving values of ΔX_(p), Δ² X² _(q), X_(pn), X_(qn) ², and ΔX² _(qn) corresponding to the Nth one of said display lines; and said decoding means comprises: a square root generating means having an input connected to the output of said first register means for calculating the square root of X_(qn) ² ; a first adder means having an addend input connected to the output of said square root generator and an augend input connected to said first register means for calculating the sum X_(pn) + X_(qn) = X_(n) and the difference X_(pn) - X_(qn) = X'_(n) as the location along said Nth display line of the intersection with said ellipse; a second and a third register means connected to the output of said first adder means for storing the values of X_(n) and X'_(n) respectively.
 11. The video generator circuit of claim 10 wherein said square root generating means further comprises:a first shift register having a data input connected to said first register means; a read only memory having its memory address input connected to the high order n bits of said first shift register, for storing the square root of the number stored in said first shift register, rounded to the n most significant bits; a second shift register having a data input connected to the data output of said read only memory and an output connected to said first adder means for receiving the value of the square root of the number stored in said first shift register rounded to the said n most significant bits; a control means connected to a control input of said first shift register and a control input of said second shift register; said control means shifting the contents of said first shift register two bits at a time for m times until a one bit occupies one of the two most significant bit positions of said first shift register, prior to accessing said read only memory with said shifted data therein; said control means shifting the contents of said second shift register one bit at a time for m times so that the accessed data occupies the least significant bit positions thereof; whereby the square root of X_(q) ² can be accessed in a minimum time with a minimum rounding error.
 12. The video generator circuit of claim 10, wherein said modifying means further comprises:a second adder means having an augend and addend inputs connected to the output of said first register means and an output as a feedback to the input of said first register means to calculate the values of X_(q) ² _(n) ₊₁ = X_(q) ² _(n) + ΔX² _(qn), ΔX² _(qn) ₊₁ = ΔX² _(qn) + Δ² X² _(q) and X_(pn) ₊₁ = X_(pn) + ΔX_(p) corresponding to the intersection of said ellipse with a line intermediate between the Nth and the N+1st ones of said display lines; said second adder means outputting the values of X² _(qn) ₊₁ and X_(pn) ₊₁ to the input of said first register means; said square root generating means of said decoding means calculating the value of X_(qn) ₊₁ input from said register means; said first adder means of said decoding means calculating the sum of X_(pn) ₊₁ + X_(qn) ₊₁ = X_(n) ₊₁ and the difference X_(pn) ₊₁ - X_(qn) ₊₁ + X'_(n) ₊₁ as the location along said line midway between said Nth and said N+1st display lines of the intersection with said ellipse.
 13. The video generator circuit of claim 12, wherein said decoding means further comprises:a fourth and a fifth register means connected to the output of said first adder means for storing the values of X_(n) ₊₁ and X'_(n) ₊₁, respectively; a comparison means connected to said 2nd, 3rd, 4th and 5th register means to determine the larger value of X_(n) or X_(n) ₊₁ and determine the larger value of X'_(n) or X'_(n) ₊₁ ; a third adder means connected to said 2nd, 3rd, 4th and 5th register means and to said comparison means to calculate the origin and length of raster strokes along with Nth display line representing intersections with said ellipse.
 14. The video generation circuit of claim 13, which further comprises:a video signal generating means having an input connected to said third adder means and an output connected to said display device for generating a video signal at the locations along said Nth display line corresponding to the intersection with said ellipse.
 15. A video generator circuit for converting randomly occurring data signals representing ellipses received from a host processor into a time sequential video signal for use with a sequentially line scanned display device which displays a field composed of raster lines, wherein the improvement comprises, in combination:an ordered refresh buffer connected to receive said data and adapted to sort said data signals into groups ordered by extremal scan line position for the ellipse represented; an intermediate buffer having a first input connected to the output of said ordered refresh buffer for storing said ordered data signals once during each display field before the display of the ellipse represented and outputting said ordered data signals in synchronism with the line scan of the display; a conic generator means which includes an input register connected to the output of said intermediate buffer and a decoding means connected to the output of said input register for decoding said ordered data signals outputted from said intermediate buffer and generating on an output line components of the ellipse represented which lie along the display line to be scanned; a partial raster assembly storage connected to said output line from said decoding means of said conic generator means, to store the components of the ellipse represented which lie along the display line to be scanned; said conic generator means further including a modifying means connected to the output of said input register, for modifying said decoded ordered data signals to identify the horizontal coordinate for the intersection of said ellipse represented with the next display line to be scanned, and outputting said modified data signal to a second input line for storage in said intermediate buffer; said conic generator means including means connected to the output of said input register to inhibit the output of a modified data signal to said intermediate buffer when no components of said ellipse will intersect succeeding display lines to be scanned in said field.
 16. The video generator circuit of claim 9, which further comprises:said raster lines having a vertical separation of Δy; said ellipse being characterized by a display axis having an inverse slope ΔX_(p) /Δy and which intersects the vertical extrema of the ellipse and an inverse rate of change of the slope of the ellipse Δ² X_(q) ² /Δ² y; said data signals including values for the constants ΔXp and Δ² X_(q) ² and values for X_(q) ², ΔX_(q) ² and Xp at the extremum of said ellipse, where X_(q) is the horizontal distance from said display axis to said ellipse.
 17. The video generator circuit of claim 16, wherein:said input register comprises a register means connected to the output of said data buffer for receiving values of ΔX_(p), Δ² X_(q) ², X_(p), X_(q) ² and ΔX_(q) ² ; and said decoding means further comprises: square root generating means having an input connected to said register means for calculating the square root of X_(q) ² ; a first adder means having an addend input connected to the output of said square root generator and an augend input connected to said register means for calculating the sum X_(p) + X_(q) and the difference X_(p) - X_(q) as the location along said display line to be scanned of the intersection with said ellipse; a video signal generating means having an input connected to said first adder means and an output connected to a partial raster assembly storage, for generating a video signal at the locations along said display line to be scanned corresponding to said values of X_(p) + X_(q) and X_(p) - X_(q).
 18. The video generator circuit of claim 17, wherein said square root generating means further comprises:a first shift register having a data input connected to said register means; a read only memory having its memory address input connected to the high order n bits of said first shift register, for storing the square root of the number stored in said first shift register, rounded to the n most significant bits; a second shift register having a data input connected to the data output of said read only memory and an output connected to said first adder means for receiving the value of the square root of the number stored in said first shift register rounded to the said n most significant bits; a control means connected to a control input of said first shift register and a control input of said second shift register; said control means shifting the contents of said first shift register two bits at a time for m times until a one bit occupies one of the two most significant bit positions of said first shift register, prior to accessing said read only memory with said shifted data therein; said control means shifting the contents of said second shift register one bit at a time for m times so that the assessed data occupies the least significant bit positions thereof; whereby the square root of X_(q) ² can be accessed in a minimum time with a minimum rounding error.
 19. The video generator circuit of claim 17, wherein said modifying means further comprises:a second adding means having augend and addend inputs connected to the output of said register means for adding ΔX_(p) to X_(p) to get a new value of X_(p), ΔX_(q) ² to X_(q) ² to get a new value of X_(q) ², and Δ² X_(q) ² to ΔX² _(q) to get a new value of ΔX_(q) ² and a sum output connected to the input of said register means; a data buffer output gate having an input connected to the output of said register means and an output connected to said second input of said intermediate buffer for rewriting said data word into said intermediate buffer with said new values for X_(p), X_(q) ² and ΔX_(q) ².
 20. The video generator circuit of claim 16, wherein:said input register comprises a first register means connected to the output of said data buffer for receiving values of ΔX_(p), Δ² X² _(q), X_(pn), X_(qn) ², and ΔX² _(qn) corresponding to an Nth one of said display lines; and said decoding means comprises: a square root generating means having an input connected to the output of said first register means for calculating the square root of X_(qn) ² ; a first adder means having an addend input connected to the output of said square root generator and an augend input connected to said first register means for calculating the sum X_(pn) + X_(qn) = X_(n) and the difference X_(pn) - X_(qn) = X'_(n) as the location along said Nth display line of the intersection with said ellipse; a second and a third register means connected to the output of said first adder means for storing the values of X_(n) and X'_(n) respectively.
 21. The video generator circuit of claim 20 wherein said square root generating means further comprises:a first shift register having a data input connected to said first register means; a read only memory address input connected to the high order n bits of said first shift register, for storing the square root of the number stored in said first shift register, rounded to the n most significant bits; a second shift register having a data input connected to the data output of said read only memory and an output connected to said first adder means for receiving the value of the square root of the number stored in said first shift register rounded to the said n most significant bits; a control means connected to a control input of said first shift register and a control input of said second shift register; said control means shifting the contents of said first shift register two bits at a time for m times until a one bit occupies one of the two most significant bit positions of said first shift register, prior to accessing said read only memory with said shifted data therein; said control means shifting the contents of said second shift register one bit at a time for m times so that the accessed data occupies the least significant bit positions thereof; whereby the square root of X_(q) ² can be accessed in a minimum time with a minimum rounding error.
 22. The video generator circuit of claim 20, wherein said modifying means further comprises:a second adder means having an augend and addend inputs connected to the output of said first register means and an output as a feedback to the input of said first register means to calculate the values of X_(q) ² _(n) ₊₁ = X_(q) ² _(n) + ΔX² _(qn), ΔX² _(qn) ₊₁ = ΔX² _(qn) + Δ² X² _(q) and X_(pn) ₊₁ = X_(pn) + ΔX_(p) corresponding to the intersection of said ellipse with a line intermediate between the Nth and the N+1st ones of said display lines; said second adder means outputting the values of X² _(qn) ₊₁ and X_(pn) ₊₁ to the input of said first register means; said square root generating means of said decoding means calculating the value of X_(qn) ₊₁ from the value of X² _(qn) ₊₁ input from said first register means; said first adder means of said decoding means calculating the sum of X_(pn) ₊₁ + X_(qn) ₊₁ and the difference X_(pn) ₊₁ - X_(qn) ₊₁ = X'_(n) ₊₁ as the location along said line midway between said Nth and said N+1st display lines of the intersection with said ellipse.
 23. The video generator circuit of claim 22, wherein said decoding means further comprises:a fourth and a fifth register means connected to the output of said first adder means for storing the values of X_(n) ₊₁ and X'_(n) ₊₁, respectively; a comparison means connected to said 2nd, 3rd, 4th and 5th register means to determine the larger value of X_(n) or X_(n) ₊₁ and determine the larger value of X'_(n) or X'_(n) ₊₁ ; a third adder means connected to said 2nd, 3rd, 4th and 5th register means and to said comparison means to calculate the origin and length of raster strokes along said Nth display line representing intersections with said ellipse.
 24. The video generator circuit of claim 23, which further comprises:a video signal generating means having an input connected to said third adder means and an output connected to said display device for generating a video signal at the locations along said Nth display line corresponding to the intersection with said ellipse.
 25. The video generator circuit of claim 16, wherein:said input register comprises a first register means connected to the output of said data buffer for receiving values of ΔX_(p), Δ² X² _(q), X_(pn), X_(qn) ², and ΔX² _(qn) corresponding to an Nth one of said display lines; and said decoding means comprises: a square root generating means having an input connected to the output of said first register means for calculating the square root of X_(qn) ² ; a first adder means having an addend input connected to the output of said square root generator and an augend input connected to said first register means for calculating the sum X_(pn) + X_(qn) = X_(n) and the difference X_(pn) - X_(qn) = X'_(n) as the location along said Nth display line of the intersection with said ellipse; a second and a third register means connected to the output of said first adder means for storing the values of X_(n) and X'_(n) respectively; a second adder means having an addend input connected to the output of said square root generator and an augend input connected to said first register means for calculating the sum X_(pn) ₊₁ + X_(qn) ₊₁ = X_(n) ₊₁ and the difference X_(pn) ₊₁ - X_(qn) ₊₁ = X'_(n) ₊₁ as the location along said N+1st display line of the intersection with said ellipse; a fourth and a fifth register means connected to the output of said second adder means for storing the values of X_(n) ₊₁ and X'_(n) ₊₁ respectively.
 26. The video generator circuit of claim 25 wherein said square root generating means further comprises:a first shift register having a data input connected to said first register means; a read only memory having its memory address input connected to the high order n bits of said first shift register, for storing the square root of the number stored in said first shift register, rounded to the n most significant bits; a second shift register having a data input connected to the data output of said read only memory and an output connected to said first adder means, for receiving the value of the square root of the number stored in said first shift register rounded to the said n most significant bits; a control means connected to a control input of said first shift register and a control input of said second shift register; said control means shifting the contents of said first shift register two bits at a time for m times until a one bit occupies one of the two most significant bit positions of said first shift register, prior to accessing said read only memory with said shifted data therein; said control means shifting the contents of said second shift register one bit at a time for m times so that the accessed data occupies the least significant bit positions thereof; whereby the square root of X_(q) ² can be accessed in a minimum time with a minimum rounding error.
 27. The video generator circuit of claim 25, wherein said modifying means further comprises:a third adder means having an augend and addend inputs connected to the output of said first register means and an output as a feedback to the input of said first register means to calculate the values of X_(q) ² _(n) ₊₁ = X_(q) ² _(n) + ΔX² _(qn), ΔX² _(qn) ₊₁ = ΔX² _(qn) + Δ² X² _(q) and X_(pn) ₊₁ = X_(pn) + ΔX_(p) corresponding to the intersection of said ellipse with a line intermediate between the Nth and the N+1st ones of said display lines; said third adder means outputting the values of X² _(qn) ₊₁ and X_(pn) ₊₁ to the input of said first register means.
 28. The video generator circuit of claim 27, wherein said decoding means further comprises:said square root generating means calculating the value of X_(qn) ₊₁ input from said first register means; a comparison means connected to said 2nd, 3rd, 4th and 5th register means to determine the larger value of X_(n) or X_(n) ₊₁ and determine the larger value of X'_(n) or X'_(n) ₊₁ ; a fourth adder means connected to said 2nd, 3rd, 4th and 5th register means and to said comparison means to calculate the origin and length of raster strokes along said Nth display line representing intersections with said ellipse; a video signal generating means having an input connected to said fourth adder means and an output connected to said display device for generating a video signal at the locations along said Nth display line corresponding to the intersection with said ellipse. 